A reduction architecture for the optimal scheduling of binary trees

نویسندگان

  • K. Ravikanth
  • P. S. Sastry
  • K. R. Ramakrishnan
  • Y. V. Venkatesh
چکیده

This paper addresses the problem of designing a parallel reduction architecture for applicative languages. An interconnection network that allows for scheduling of binary trees of arbitrary depth is presented. It is shown that using a static scheduling strategy the architecture achieves optimal performance while scheduling complete binary trees. Some issues related to the design of a machine based on this network are also discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

A Binary-Tree Architecture for Scheduling Real-Time Systems with Hard and Soft Tasks

Complex real-time systems require jointly schedule both periodic task and aperiodic tasks with hard and soft deadlines. This problem has been subject of considerably research in real-time systems and one of the most widely accepted solutions are dynamic slack stealing algorithms (DSS) for scheduling aperiodic tasks, running with earliest deadline first (EDF) algorithms for scheduling periodic o...

متن کامل

Scheduling Trees with Communication Delays

Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...

متن کامل

Optimal Scheduling of Coordinated Wind-Pumped Storage-Thermal System Considering Environmental Emission Based on GA Based Heuristic Optimization Algorithm

The integration of renewable wind and pumped storage with thermal power generation allows for dispatch of wind energy by generation companies (GENCOs) interested in participation in energy and ancillary services markets. However, to realize the maximum economic profit, optimal coordination and accounting for reduction in cost for environmental emission is necessary. The goal of this study is to...

متن کامل

Optimal DG Placement for Power Loss Reduction and Improvement Voltage Profile Using Smart Methods

Distributed Generations (DGs) are utilized to supply the active and reactive power in the transmission and distribution systems. These types of power sources have many benefits such as power quality enhancement, voltage deviation reduction, power loss reduction, load shedding reduction, reliability improvement, etc. In order to reach the above benefits, the optimal placement and sizing of DG is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Future Generation Comp. Syst.

دوره 4  شماره 

صفحات  -

تاریخ انتشار 1988